Appendix To Reducing Tardiness Under Global Scheduling by Splitting Jobs

نویسندگان

  • Jeremy P. Erickson
  • James H. Anderson
چکیده

T split i = T base i si , (A.9) and we add a prime to any variable to indicate the version that accounts for overheads. Aside from the modifications described below, we model split tasks as full tasks with worst-case execution time C i and period T split i , so that subjobs function as jobs. As discussed in Sec. 5, several overheads cannot be incurred by all subjobs. The event latency ∆ appears in (8), but can only affect an initial subjob. Because it measures an event that occurs outside the CPU, this particular overhead is actually incurred by the base job rather than the subjob. Therefore, instead of charging ∆ to every subjob period by defining

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Memetic Algorithm for Parallel Machine Scheduling

This paper focuses on the problem of scheduling a set of independent jobs with setup times and job splitting, on a set of identical parallel machines such that total tardiness is minimized. In this study, it is assumed that a job can be split into sub-jobs and these sub-jobs can be processed independently on parallel machines. Because the problem is NP-hard, a memetic algorithm (MA) is proposed...

متن کامل

Parallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm

This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...

متن کامل

Design of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize Job Tardiness and Machine Deteriorating Costs with Deteriorating Jobs in a Batched Delivery System

This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...

متن کامل

Scheduling Jobs on Several Machines with the Job Splitting Property

This scheduling model is derived from the real problem of scheduling looms in a textile industry. Jobs may be independently split over several specified machines and preemption is allowed. Deadlines are specified for each job and jobs are assumed to be available. It is shown that minimizing maximum weighted tardiness can be done in polynomial time. The case of uniform machines (as in the consid...

متن کامل

Minimizing earliness–tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint

This paper considers a scheduling problem for a single burn-in oven in the semiconductor manufacturing industry where the oven is a batch processing machine with restricted capacity. The batch processing time is set by the longest processing time among those of all the jobs contained in the batch. All jobs are assumed to have the same due date. The objective is to minimize the sum of the absolu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012